Axioms for the optimal stable rules and fair-division rules in a multiple-partners job market

نویسندگان

چکیده

In the multiple-partners job market, introduced in ( Sotomayor, 1992 ), each firm can hire several workers and worker be hired by firms, up to a given quota. We show that, contrast what happens simple assignment game, this extension, firms-optimal stable rules are neither valuation monotonic nor pairwise monotonic. However, we that satisfy weaker property, call firm-covariance , property characterizes these among all rules. This allows us shed some light on how firms (and cannot) manipulate particular, cannot them constantly over-reporting their valuations. Analogous results hold when focusing workers. Finally, extend market known characterization of fair-division domain games.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

data mining rules and classification methods in insurance: the case of collision insurance

assigning premium to the insurance contract in iran mostly has based on some old rules have been authorized by government, in such a situation predicting premium by analyzing database and it’s characteristics will be definitely such a big mistake. therefore the most beneficial information one can gathered from these data is the amount of loss happens during one contract to predicting insurance ...

15 صفحه اول

Optimal control rules for scheduling job shops

In this paper, we develop the control rules for job shop scheduling based on the Flow Rate Control model. We derive optimal control results for job shops with work station in series (transfer line). We use these results to derive rules which are suboptimal, robust against random events, and easy to implement and expand.

متن کامل

Some Neglected Axioms in Fair Division

Conditions one might impose on fair allocation procedures are introduced. Nondiscrimination requires that agents share an item in proportion to their entitlements if they receive nothing else. The “price” procedures of Pratt (2007), including the Nash bargaining procedure, satisfy this. Other prominent efficient procedures do not. In two-agent problems, reducing the feasible set between the sol...

متن کامل

Fair and Robust Power Allocation Rules for Multiple Access Channels

We introduce some game theoretic notions of fairness and robustness in determining power allocations for the multiple access channel. We describe a procedure, the wireless fair-share protocol (WFS) which satisfies a strong fairness requirement and in the case where devices have “elastic demands” leads to games with unique and non-manipulable Nash equilibria. When there are multiple channels, th...

متن کامل

Rewriting Rules into SROIQ Axioms

Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with two approaches: (i) use rules as they are knowing that it leads to undecidability. (ii) or make the rules DL-safe, which will restrict their semantic impact and, e.g., loose the nice “car owners are engine owners” infe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Games and Economic Behavior

سال: 2022

ISSN: ['0899-8256', '1090-2473']

DOI: https://doi.org/10.1016/j.geb.2022.10.005